Search results for "Network partition"

showing 2 items of 2 documents

Col : A Data Collection Protocol for Vanet

2012

International audience; In this paper, we present a protocol to collect data within a vehicular ad hoc network (VANET). In spite of the intrinsic dynamic of such network, our protocol simultaneously offers three relevant properties: (1) It allows any vehicle to collect data beyond its direct neighborhood (i.e., vehicles within direct communication range) using vehicle-to-vehicle communications only (i.e., the infrastructure is not required); (2) It tolerates possible network partitions; (3) It works on demand and stops when the data collection is achieved. To the best of our knowledge, this is the first collect protocol having these three characteristics. All that is chiefly obtained thanks…

data collection protocolVehicular communication systemsVANETCorrectnessnetwork operator antComputer sciencedata acquisitionDistributed computing[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]self-stabilization area02 engineering and technologyVehicle dynamics[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]Transient analysis[SPI]Engineering Sciences [physics]0203 mechanical engineeringvehicular ad hoc networkvehicle to vehicle communication0202 electrical engineering electronic engineering information engineeringAlgorithm design and analysisHeuristic algorithmsCOL algorithmProtocol (object-oriented programming)ComputingMilieux_MISCELLANEOUSAirplug software distributionVehicular ad hoc networkData collectionbusiness.industryNetwork partitionnetwork partition020206 networking & telecommunications020302 automobile design & engineeringVehiclesSoftware distributionRoadsAlgorithm designvehicular ad hoc networksbusinessProtocolsComputer network
researchProduct

A Clustering Approach for Improving Network Performance in Heterogeneous Systems

2000

A lot of research has focused on solving the problem of computation-aware task scheduling on heterogeneous systems. In this paper, we propose a clustering algorithm that, given a network topology, provides a network partition adapted to the communication requirements of the applications running on the machine. Also, we propose a criterion to measure the quality of each one of the possible mappings of processes to processors based on that network partition. Evaluation results show that these proposals can greatly improve network performance, providing a basis of a communication-aware scheduling technique.

Computer scienceDistributed computingNetwork partitionNetwork performanceThroughputNetwork topologyCluster analysisNetwork simulationScheduling (computing)
researchProduct